Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters
نویسندگان
چکیده
We consider the class of pentagonal 3-polytopal graphs all of whose edges are incident either with two 3-valent vertices or with a 3-valent vertex and a q-valent vertex. For most values of q, (i) we find a small non-hamiltonian graph in the class and (ii) we show that the shortness exponent of the class and the shortness coefficient of a special subclass are less than one. For q--4, we find a positive lower bound for the shortness coefficient.
منابع مشابه
Polytopality and Cartesian products of graphs
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we present three families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On ...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کاملPolytopal complexes realizing products of graphs
When is the Cartesian product of two graphs the graph of a polytope, of a cellular sphere, or even of a combinatorial manifold? In this note, we determine all 3-polytopal complexes whose graph is the Cartesian product of a 3-cycle by a Petersen graph. Through this specific example, we showcase certain techniques which seem relevant to enumerate all polytopal complexes realizing a given product....
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 137 شماره
صفحات -
تاریخ انتشار 1995